41 research outputs found
Description and formal specification of the link layer of P1394
We give a formal specification in CRL of the Link Layer as described in the IEEE document ``P1394 Standard for a High Performance Serial Bus''; this specification may serve as a starting point for further verification
Decomposition orders : another generalisation of the fundamental theorem of arithmetic
We discuss unique decomposition in partial commutative monoids. Inspired by a result from process theory, we propose the notion of decomposition order for partial commutative monoids, and prove that a partial commutative monoid has unique decomposition iff it can be endowed with a decomposition order. We apply our result to establish that the commutative monoid of weakly normed processes modulo bisimulation definable in ACPe with linear communication, with parallel composition as binary operation, has unique decomposition. We also apply our result to establish that the partial commutative monoid associated with a well-founded commutative residual algebra has unique decompositio
A complete axiomatisation of branching bisimulation for process algebras with alternative quantification over data
We define a class of process algebras with silent step and a generalised operation gsum{ that allows explicit treatment of emph{alternative quantification over data, and we investigate the specific subclass formed by the algebras of finite processes modulo rooted branching bisimulation. We give a ground complete axiomatisation for those branching bisimulation algebras of which the data part has built-in equality and Skolem functions
Sequential Composition in the Presence of Intermediate Termination (Extended Abstract)
The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequence. Due to transparency, the correspondence between context-free and pushdown processes fails modulo bisimilarity, and it is not clear how to specify an always terminating half counter. We propose a revised operational semantics for the sequential composition operator in the context of intermediate termination. With the revised operational semantics, we eliminate transparency, allowing us to establish a close correspondence between context-free processes and pushdown processes. Moreover,we prove the reactive Turing powerfulness of TCP with iteration and nesting with the revised operational semantics for sequential composition
Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity
The Theory of Sequential Processes includes deadlock, successful termination, action prefixing, alternative and sequential composition. Intermediate acceptance, which is important for the integration of classical automata theory, can be expressed through a combination of alternative composition and successful termination. Recently, it was argued that complications arising from the interplay between intermediate acceptance and sequential composition can be eliminated by replacing sequential composition by sequencing. In this paper we study the equational theory of the recursion-free fragment of the resulting process theory modulo bisimilarity, proving that it is not finitely based, but does afford a ground-complete axiomatisation if a unary auxiliary operator is added. Furthermore, we prove that bisimilarity is decidable for processes definable by means of a finite guarded recursive specification over the process the
Parallel pushdown automata and commutative context-free grammars in bisimulation semantics
A classical theorem states that the set of languages given by a pushdown automaton coincides with the set of languages given by a context-free grammar. In previous work, we proved the pendant of this theorem in a setting with interaction: the set of processes given by a pushdown automaton coincides with the set of processes given by a finite guarded recursive specification over a process algebra with actions, choice, sequencing and guarded recursion, if and only if we add sequential value passing. In this paper, we look what happens if we consider parallel pushdown automata instead of pushdown automata, and a process algebra with parallelism instead of sequencing
Reactive Turing machines
We propose reactive Turing machines (RTMs), extending classical Turing machines with
a process-theoretical notion of interaction, and use it to define a notion of executable
transition system. We show that every computable transition system with a bounded
branching degree is simulated modulo divergence-preserving branching bisimilarity by
an RTM, and that every effective transition system is simulated modulo the variant of
branching bisimilarity that does not require divergence preservation. We conclude from
these results that the parallel composition of (communicating) RTMs can be simulated by
a single RTM. We prove that there exist universal RTMs modulo branching bisimilarity, but
these essentially employ divergence to be able to simulate an RTM of arbitrary branching
degree. We also prove that modulo divergence-preserving branching bisimilarity there are
RTMs that are universal up to their own branching degree. We establish a correspondence
between executability and finite definability in a simple process calculus. Finally, we
establish that RTMs are at least as expressive as persistent Turing machines